Towards Rigorous Compiler
نویسندگان
چکیده
This paper sketches a rigorous correctness proof of a compiler executable. We will emphasize the central r^ ole of partial program correctness and its preservation, which captures the intuitive correct-ness requirements for transformational programs and in particular for compilers on real machines. Although often left out of sight, implementation veriication is deenitely necessary, not only but also for compilers. We will show that a rigorous compiler correctness proof also for the-nal binary compiler machine program is possible and feasible. Veriied compiler implementations guarantee correctness properties for generated executable program implementations; we need them, not only in safety critical systems, but also for security in e.g. network computing.
منابع مشابه
Towards Rigorous Compiler Implementation Verification
This paper sketches our approach to rigorously prove the correctness of a compiler executable down to its binary machine code implementation. We will emphasize the central r^ ole of partial program correctness and its preservation, which capture the intuitive correctness requirements for transformational programs and in particular for compilers on realistic machines. Vertical and horizontal com...
متن کاملA comprehensive operational semantics of the SCOOP programming model
Operational semantics is a flexible but rigorous means to describe the meaning of programming languages. Small semantics are often preferred, for example to facilitate model checking. However, omitting too many details in a semantics limits results to a core language only, leaving a wide gap towards real implementations. In this paper we present a comprehensive semantics of the concurrent progr...
متن کاملA Formal Reference for SCOOP
Operational semantics is a flexible but rigorous means to describe the meaning of programming languages. Small semantics are often preferred, for example to facilitate model checking. However, omitting too many details in a semantics limits results to a core language only, leaving a wide gap towards real implementations. In this paper we present a comprehensive semantics of the concurrent progr...
متن کاملProving the Correctness of Compiler Optimizations Based on Strictness Analysis
We show that compiler optimisations based on strictness analysis can be expressed formally in the functional framework using continuations. This formal presentation has two beneets: it allows us to give a rigorous correctness proof of the optimised compiler; and it exposes the various optimisations made possible by a strictness analysis.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998